An Improved Leader Election Protocol in Multi-hop Radio Networks
نویسندگان
چکیده
This paper presents two randomized protocols for the problem of electing a \leader" among a set of nodes in an arbitrary multi-hop radio network. First, a variation of the leader election protocol by Bar-Yehuda et al. BGI87] is presented, in which the termination problem is addressed. Then, an eecient randomized leader election protocol in arbitrary multi-hop radio networks is presented. Our election protocol is shown both analytically and experimentally to be asymptotically more eecient than previously known leader election protocols for (almost) all networks. Also, the protocol is much simpler than previously known leader election protocols.
منابع مشابه
Near Optimal Leader Election in Multi-Hop Radio Networks
We present distributed randomized leader election protocols for multi-hop radio networks that elect a leader in almost the same time TBC required for broadcasting a message. For the setting without collision detection, our algorithm runs with high probability in O(D log n D + log n) · min{log logn, log n D } rounds on any n-node network with diameter D. Since TBC = Θ(D log n D + log n) is a low...
متن کاملDeterministic Leader Election in Multi-hop Beeping Networks - (Extended Abstract)
We study deterministic leader election in multi-hop radio networks in the beeping model. More specifically, we address explicit leader election: One node is elected as the leader, the other nodes know its identifier, and the algorithm terminates at some point with the network being quiescent. No initial knowledge of the network is assumed, i.e., nodes know neither the size of the network nor th...
متن کاملLeader Election Algorithms for Multi-channel Wireless Networks
We study the leader election problem in single-hop multichannel wireless networks with single-antenna radio nodes. The objective is to elect leaders for all channels on which one or more nodes in the network can operate. We assume that nodes do not have collision detection capability. In this paper, we propose three algorithms for leader election: one deterministic and two randomized. The deter...
متن کاملExploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameterD, randomized broadcasting requiresΩ(D log n D +log n) rounds in expectation, assuming that uninformed no...
متن کاملMaster Thesis : “ Energy - Efficient Jamming and Countermeasures ”
Since wireless networks use a shared medium they are exposed to jamming attacks. Such attacks are carried out by an adversary emitting radio frequency signals. They can severely interfere with the normal operation of wireless networks and, consequently, mechanisms are needed that can cope with jamming attacks. However, unless the adversary has unlimited capacities, it cannot jam all communicati...
متن کامل